ExBCG-TC: Extended Borel Cayley Graph Topology Control for Ad Hoc Networks
نویسندگان
چکیده
In our previous work, we demonstrated that the Borel Cayley Graph topology control (BCG-TC) is an efficient topology control algorithm for producing an underlying network topology resembling a 4-regular Borel Cayley Graph and assuring small diameter, short average path length and superb power efficiency. But the BCG-TC networks are unlikely to be connected below a certain radio range threshold due to isolated nodes or isolated subnetworks. In this paper, we propose a topology control algorithm, EXTENDED BCG-TC (EXBCG-TC), that effectively improves network connectivity of network topology generated by BCG-TC. Our EXBCG-TC works by injecting a small number of nodes into the network and connecting them to nodes already in the network. Throughout the efficient rules for establishing connection (namely the Request Criterion and the Accept Criterion), the proportion of isolated nodes or isolated subnetworks is significantly reduced or totally eliminated. The resulting network topologies are more likely to be fully connected with radio range much smaller than the radio range threshold of the BCG-TC while preserving the outstanding network topological properties and power efficiency of BCG-TC network topologies.
منابع مشابه
Creating Dynamic Sub-Route to Control Congestion Based on Learning Automata Technique in Mobile Ad Hoc Networks
Ad hoc mobile networks have dynamic topology with no central management. Because of the high mobility of nodes, the network topology may change constantly, so creating a routing with high reliability is one of the major challenges of these networks .In the proposed framework first, by finding directions to the destination and calculating the value of the rout the combination of this value with ...
متن کاملCreating Dynamic Sub-Route to Control Congestion Based on Learning Automata Technique in Mobile Ad Hoc Networks
Ad hoc mobile networks have dynamic topology with no central management. Because of the high mobility of nodes, the network topology may change constantly, so creating a routing with high reliability is one of the major challenges of these networks .In the proposed framework first, by finding directions to the destination and calculating the value of the rout the combination of this value with ...
متن کاملPseudo-Random Graphs for Fast Consensus Protocol
In this paper, we focus on the design of network topology to achieve fast information distribution. We present the information distribution performance of Borel Cayley graphs, a family of pseudo-random graphs, is far superior than that of other well-known graph families. To demonstrate the effectiveness of this pseudo-random approach, we compare the convergence speed of the average consensus pr...
متن کاملSurvey the Security Function of Integration of vehicular ad hoc Networks with Software-defiend Networks
In recent years, Vehicular Ad Hoc Networks (VANETs) have emerged as one of the most active areas in the field of technology to provide a wide range of services, including road safety, passenger's safety, amusement facilities for passengers and emergency facilities. Due to the lack of flexibility, complexity and high dynamic network topology, the development and management of current Vehicular A...
متن کاملاستفاده از خوشه بندی در پروتکل مسیریابی AODV برای شبکه های بین خودرویی بر روی سناریوی بزرگراه
Vehicular Ad hoc networks are a subset of mobile Ad hoc networks in which vehicles are considered as network nodes. Their major difference is rapid mobility of nodes which causes the quick change of topology in this network. Quick changes in the topology of the network are considered as a big challenge For routing in these networks, routing protocols must be robust and reliable. AODV Routing pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010